Combining Constraint Network and Causal Theory to Solve Scheduling Problems from a CSP Perspective

The Constraint Satisfaction Problem (CSP) is one of the areas of artiicial intelligence where a signiicant amount of problem classiication and complexity analysis has co-occurred. For a large class of scheduling problems, described in a CSP notation, we propose a hypergraph as an underlying structure. We show that using causal theories, based on the nature of constraints, can lead to a signiicant eecient improvement in solving this class of scheduling problems. The complexity of the new strategy is analyzed as well.